Multicolour containers and the entropy of decorated graph limits

نویسندگان

  • Victor Falgas-Ravry
  • Kelly O’Connell
  • Johanna Strömberg
  • Andrew Uzzell
چکیده

In recent breakthrough results, Saxton–Thomason and Balogh–Morris–Samotij have developed powerful theories of hypergraph containers. These theories have led to a large number of new results on transference, and on counting and characterising typical graphs in hereditary properties. In a different direction, Hatami–Janson–Szegedy proved results on the entropy of graph limits which enable us to count and characterise graphs in dense hereditary properties. In this paper, we make a threefold contribution to this area of research: (i) We generalise results of Saxton–Thomason to obtain container theorems for general, dense hereditary properties of multicoloured graphs. Our main tool is the adoption of an entropybased framework. As corollaries, we obtain general counting, characterization and transference results. We further give a streamlined extension of our results to cover a great variety of combinatorial structures: directed graphs, oriented graphs, tournaments, multipartite graphs, multi-graphs, hypercubes and hypergraphs. (ii) We generalise the results of Hatami–Janson–Szegedy on the entropy of graph limits to the setting of decorated graph limits. In particular we define a cut norm for decorated graph limits and prove compactness of the space of decorated graph limits under that norm. (iii) We explore a weak equivalence between the container and graph limit approaches to counting and characterising graphs in hereditary properties. In one direction, we show how our multicolour containers may be used to fully recover decorated versions of the results of Hatami–Janson–Szegedy. In the other direction, we show that our decorated extensions of Hatami–Janson–Szegedy’s results on graph limits imply counting and characterization applications. Finally, we raise the problem of determining the possible structure of entropy maximisers in a multicoloured setting, and discuss the contrasts between the container and the graph limit approaches to counting. Similar container results were recently obtained independently by Terry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH

Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...

متن کامل

Entropy Estimate for Maps on Forests

A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...

متن کامل

An Optimal Approach to Local and Global Text Coherence Evaluation Combining Entity-based, Graph-based and Entropy-based Approaches

Text coherence evaluation becomes a vital and lovely task in Natural Language Processing subfields, such as text summarization, question answering, text generation and machine translation. Existing methods like entity-based and graph-based models are engaging with nouns and noun phrases change role in sequential sentences within short part of a text. They even have limitations in global coheren...

متن کامل

Graph Hybrid Summarization

One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...

متن کامل

Detection and Determination of some Migrated Chemicals from Plastic Containers into Different Drinks and Liquids Using Dispersive Liquid-liquid Microextraction Prior to Gas Chromatography

Migration of chemicals from plastic containers into drinks and liquids containing them, is supposed to be a hazardous phenomenon and results in many health problems. Sample preparation is of great importance due to trace amounts analysis of these compounds. In this research, dispersive liquid–liquid microextraction is applied for the extraction and preconcentration of the migrated compounds pri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016